Covering the complete graph with plane cycles
نویسندگان
چکیده
منابع مشابه
Efficient Covering Designs of the Complete Graph
Let H be a graph. We show that there exists n0 = n0(H) such that for every n ≥ n0, there is a covering of the edges of Kn with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.
متن کاملEecient Covering Designs of the Complete Graph
Let H be a graph. We show that there exists n 0 = n 0 (H) such that for every n n 0 , there is a covering of the edges of K n with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.
متن کاملPacking and covering the complete graph with cubes
A decomposition of Kn \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum packing of Kn with G if L contains as few edges as possible. A decomposition of Kn U P, the complete graph union a graph P (called the padding), into edge disjoint copies of a graph G is called a minimum covering of Kn with G if P conta...
متن کاملCovering a bipartite graph with cycles passing through given edges
We propose a conjecture: for each integer k 2:: 2, there exists N (k) such that if G = (Vb \12; E) is a bipartite graph with IV11 = 1\121 = n 2: N(k) and d( x) + d(y) 2: n + k for each pair of non-adjacent vertices x and y of G with x E V1 and y E \12, then for any k independent edges el, ... , ek of G, there exist k vertex-disjoint cycles G1, ... , Gk in G such that ei E E(Gi ) for all i E {I,...
متن کاملCyclically decomposing the complete graph into cycles
Let m1; m2; : : : ; mk be positive integers not less than 3 and let n= ∑k i=1 mi. Then, it is proved that the complete graph of order 2n+ 1 can be cyclically decomposed into k(2n+ 1) cycles such that, for each i= 1; 2; : : : ; k, the cycle of length mi occurs exactly 2n+ 1 times. c © 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90239-k